A Novel Method for Scheduling of Wireless Ad Hoc Networks in Polynomial Time

In this article, we address the scheduling problem in wireless ad hoc networks by exploiting computational advantage that comes when problems can be represented claw-free conflict graphs where consider a broadcast medium. It is possible to formulate of transmissions as finding maximum weighted independent set (MWIS) graph network. Finding MWIS general NP-hard leading an complexity scheduling. graph, may found polynomial time throughput-optimal We show certain are claw-free. order obtain networks, suggest introducing additional conflicts (edges) with aim keeping decrease size minimal. To end, introduce iterative optimization decide edges and investigate its efficient implementation. conclude claw breaking method adding extra perform very close optimal scenario better than maximal benchmark under necessary assumptions.